Parallel communicating grammar systems with bounded resources
نویسندگان
چکیده
منابع مشابه
Parallel Communicating Grammar Systems with Negotiation
In a parallel communicating grammar system, several grammars work together , synchronously, on their own sentential forms, and communicate on request. No restriction is imposed usually about the communicated strings. We consider here two types of restrictions, as models of the negotiation process in multi-agent systems: (1) conditions formulated on the transmitted strings, and (2) conditions fo...
متن کاملPattern Languages Versus Parallel Communicating Grammar Systems
We compare the power of two (fairly di erent) recently investigated language identifying devices: patterns and parallel communicating (PC) grammar systems. The simulation of multi-patterns by context-free PC grammar systems is rather obvious, but, unexpectedly, this can be realized also by (non-centralized) PC grammar systems with right-linear components. Moreover, in nite multi-patterns formin...
متن کاملContext-Free Parallel Communicating Grammar Systems Are Not Linear Space
Two contradictory results state that the synchronized parallel communicating grammar systems with context-free components (CF-PCGS) are either Turing complete or less expressive than contextsensitive grammars. We show that the latter result is incorrect. Indeed, we discover that the proof of this result relies on coverability trees for CF-PCGS, but that such coverability trees do not contain en...
متن کاملSzilard Languages Associated to Parallel Communicating Grammar Systems
We associate Szilard and extended Szilard languages to parallel communicating grammar systems, starting from labels associated to productions of the components of the systems. We study families of such languages associated to various classes of parallel communicating grammar systems, comparing them to each other, to families of languages generated by regulated rewriting devices or by parallel c...
متن کاملOn Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Abstract. This paper contributes to the study of Freely Rewriting Restarting Automata (FRR-automata) and Parallel Communicating Grammar Systems (PCGS), which both are useful models in computational linguistics. For PCGS we study two complexity measures called generation complexity and distribution complexity, and we prove that a PCGS Π , for which the generation complexity and the distribution ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00172-4